Characterizations of the Dyck sets
نویسندگان
چکیده
منابع مشابه
Dyck-based characterizations of Indexed Languages
Indexed languages are languages recognized by pushdown automata of level 2 and by indexed grammars. We propose here some new characterizations linking indexed languages to context-free languages: the class of indexed languages is the image of the Dyck language by a nice class of context-free transducers, it is also the class of images, by a projection defined by an FO-formula of nested words la...
متن کاملCharacterizations of postman sets
Using results by McKee and Woodall on binary matroids, we prove that the set of postman sets has odd cardinality, generalizing a result by Toida on the cardinality of cycles in Eulerian graphs. We study the relationship between T-joins and blocks of the underlying graph, obtaining a decomposition of postman sets in terms of blocks. We conclude by giving several characterizations of T-joins whic...
متن کاملCharacterizations and properties of bounded $L$-fuzzy sets
In 1997, Fang proposed the concept of boundedness of $L$-fuzzy setsin $L$-topological vector spaces. Since then, this concept has beenwidely accepted and adopted in the literature. In this paper,several characterizations of bounded $L$-fuzzy sets in$L$-topological vector spaces are obtained and some properties ofbounded $L$-fuzzy sets are investigated.
متن کاملArithmetic Characterizations of Sidon Sets
Let G be any discrete Abelian group. We give several arithmetic characterizations of Sidon sets in G. In particular, we show that a set A is a Sidon set iff there is a number 6 > 0 such that any finite subset A of A contains a subset B Q A with |B| > 6\A\ which is quasiindependent, i.e. such that the only relation of the form ]C\eB e x ^ = '̂ with e\ equal to + 1 or 0, is the trivial one. Let G ...
متن کاملCharacterizations of semicomputable sets of real numbers
We give some characterizations of semicomputability of sets of reals by programs in certain While programming languages over a topological partial algebra of reals. We show that such sets are semicomputable if and only if they are one of the following: (i) unions of effective sequences of disjoint algebraic open intervals; (ii) unions of effective sequences of rational open intervals; (iii) uni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO. Informatique théorique
سال: 1977
ISSN: 0399-0540
DOI: 10.1051/ita/1977110100531